Towards a Domain Theory for Termination Proofs
نویسنده
چکیده
We present a general framework for termination proofs for Higher Order Rewrite Sys tems The method is tailor made for having simple proofs showing the termination of enriched calculi
منابع مشابه
Continuous Semantics for Termination Proofs
We prove a general strong normalization theorem for higher type rewrite systems based on Tait’s strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel’s system T , but also to various forms of bar recursion for which strong normalization was hitherto unknown.
متن کاملFormalising Strong Normalisation Proofs of the Explicit Substitution Calculi in Alf
Explicit substitution calculi have become very fashionable in the last decade. The reason is that substitution calculi bridge theory and implementation and enable control over evaluation steps and strategies. Of the most important questions of explicit substitution calculi is that of the termination of the underlying calculus of substitution (without-reduction rule). For this reason, one nds wi...
متن کاملKleene Algebras with Domain
Kleene algebras with domain are Kleene algebras endowed with an operation that maps each element of the algebra to its domain of definition (or its complement) in abstract fashion. They form a simple algebraic basis for Hoare logics, dynamic logics or predicate transformer semantics. We formalise a modular hierarchy of algebras with domain and antidomain (domain complement) operations in Isabel...
متن کاملTermination in Modal Kleene Algebra
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via domain and codomain operations. The paper investigates the algebraic structure of modal operators. It studies and compares different notions of termination in this class, including an algebraic correspondence proof of Löb’s formula from modal logic. It gives calculational proofs of two fundamental st...
متن کاملTowards Automated Termination Proofs through "Freezing"
We present a transformation technique called freezing to facilitate automatic termination proofs for left-linear term rewriting systems. The significant merits of this technique lie in its simplicity, its amenability to automation and its effectiveness, especially, when combined with other well-known methods such as recursive path orderings and polynomial interpretations. We prove that applying...
متن کامل